Static Task Allocation Using ( ; )

نویسندگان

  • Ajay K. Gupta
  • Garrison W. Greenwood
چکیده

Allocating tasks optimally in distributed systems is a NP-hard problem which has lead researchers to adopt heuristic techniques. In the past Evolutionary Strategies have been shown to be capable of eeciently determining good allocations. All of this previous work has used the (+) version of the evolutionary strategy. In this paper we show that the (;) version of evolutionary strategy can nd even better task allocations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

Task Allocation in Dynamic Networks of Satellites

The management of distributed satellite systems requires the coordination of a large number of heterogeneous spacecraft. Task allocation in such a system is complicated by limited communication and individual satellite dynamics. Previous work has shown that task allocation using a market-based mechanism can provide scalable and efficient management of static networks; in this paper we extend th...

متن کامل

Task allocation in networks of satellites with Keplerian dynamics

e management of distributed satellite systems requires the coordination of a large number of heterogeneous spacecraft. Task allocation in such a system is complicated by limited communication and individual satellite dynamics. Previous work has shown that task allocation using a market-based mechanism can provide scalable and efficient management of static networks; in this paper we extend thi...

متن کامل

Cycle Time Optimization of Processes Using an Entropy-Based Learning for Task Allocation

Cycle time optimization could be one of the great challenges in business process management. Although there is much research on this subject, task similarities have been paid little attention. In this paper, a new approach is proposed to optimize cycle time by minimizing entropy of work lists in resource allocation while keeping workloads balanced. The idea of the entropy of work lists comes fr...

متن کامل

Collection Path Ant Colony Optimization for Multi - agent Static Task Allocation ?

Mutual cooperation in Multi-Agent Systems is an important means to implement complex applications. The static task allocation is one of the key issues in agent cooperation mechanism. The latency of the network infrastructure, dynamic topology and node heterogeneity are important features of the agent system, and they bring new challenges to the static task allocation in multi-agent environment....

متن کامل

Evaluating the importance of dynamic allocation and routing of rescuers in reducing response time

Due to delay in receiving emergency medical services, a high number of injured people and patients annually lose their lives. Determining the medical service area and correct routing of rescuing operation is influential on the reduction of rescuers’ response time. Changing the traffic flow leads to change of medical service area. Therefore, it is expected that by observing changing traffic, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996